847G - University Classes - CodeForces Solution

implementation *900

Please click on ads to support us..

Python Code: 

t=int(input())
temp=[]
c=0
count=[]

if t==1:
    l=list(input())
    if l.count('1')==0:
        print(0)
    else:
        print(1)
else:
    for i in range(t):
        l=list(input())
        temp.append(l)
    
    for k in range(7):
        c=0
        for j in temp:
            if j[k]=='1':
                c+=1
        count.append(c)
    print(max(count))

C++ Code: 

#include <iostream>
#include <math.h>
using namespace std;

int main () {
    int n;
    cin >> n;
    string classes[n];

    for (int i = 0; i < n; i++) {
        cin >> classes[i];
    }
    
    int maxClass = 0, countClass = 0;

    for (int j = 0; j < 7; j++) {
        for (int i = 0; i < n; i++) {
            if (classes[i][j] == '1') {
                countClass++;
            }
        }
        
        if (countClass > maxClass) {
            maxClass = countClass;
        }
        
        countClass = 0;
    }

    cout << maxClass;

    return 0;
}


Comments

Submit
0 Comments
More Questions

230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns